Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT
نویسنده
چکیده
This survey reviews the basic notions of parameterized complexity, and describes some new approaches to designing FPT algorithms and problem reductions for graph problems.
منابع مشابه
. A G ] 2 4 A pr 1 99 8 Gromov - Witten invariants of blow - ups
In the first part of the paper, we give an explicit algorithm to compute the (genus zero) Gromov-Witten invariants of blow-ups of an arbitrary convex projective variety in some points if one knows the Gromov-Witten invariants of the original variety. In the second part, we specialize to blow-ups of Pr and show that many invariants of these blow-ups can be interpreted as numbers of rational curv...
متن کاملm at h . A G ] 8 A pr 1 99 8 Gromov - Witten invariants of blow - ups
In the first part of the paper, we give an explicit algorithm to compute the (genus zero) Gromov-Witten invariants of blow-ups of an arbitrary convex projective variety in some points if one knows the Gromov-Witten invariants of the original variety. In the second part, we specialize to blow-ups of Pr and show that many invariants of these blow-ups can be interpreted as numbers of rational curv...
متن کاملGromov-Witten invariants of blow-ups
In the first part of the paper, we give an explicit algorithm to compute the (genus zero) Gromov-Witten invariants of blow-ups of an arbitrary convex projective variety in some points if one knows the Gromov-Witten invariants of the original variety. In the second part, we specialize to blow-ups of Pr and show that many invariants of these blow-ups can be interpreted as numbers of rational curv...
متن کاملA Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing
The talk will survey the rich toolkit of FPT algorithm design methodologies that has developed over the last 20 years, including “older” techniques such as well-quasi-ordering, bounded treewidth, color-coding, reduction to a problem kernel, and bounded search trees — which have continued to deepen and advance — as well as some recently developed approaches such as win/win’s, greedy localization...
متن کاملGreedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover
The two objectives of this paper are: (1) to articulate three new general techniques for designing FPT algorithms, and (2) to apply these to obtain new FPT algorithms for Set Splitting and Vertex Cover. In the case of Set Splitting, we improve the best previous O(72) FPT algorithm due to Dehne, Fellows and Rosamond [DFR03], to O(8) by an approach based on greedy localization in conjunction with...
متن کامل